Vectorized and Parallel Computation of Large Smooth-Degree Isogenies using Precedence-Constrained Scheduling

نویسندگان

چکیده

Strategies and their evaluations play important roles in speeding up the computation of large smooth-degree isogenies. The concept optimal strategies for such was introduced by De Feo et al., virtually all implementations isogeny-based protocols have adopted this approach, which is provably single-core platforms. In spite its inherent sequential nature, several recent works studied ways isogeny exploiting rich parallelism available vectorized multi-core One obstacle to taking full advantage parallelism, however, that al.’s are not necessarily environments. To illustrate how speed parallel can be improved at strategylevel, we present two novel software utilize a state-of-the-art evaluation technique, called precedence-constrained scheduling (PCS), presented Phalakarn with our proposed crafted these Our first implementation relies only on provided processors. second targets processors supporting latest generation Intel’s Advanced Vector eXtensions (AVX) technology, commonly known as AVX-512IFMA instructions. better handle computational concurrency associated PCS, equip both extensive synchronization techniques. outperforms Cervantes-Vázquez al. yielding 14.36% reduction execution time, when targeting platforms two- four-core implementation, equipped four cores, achieves 34.05% time compared Cheng CHES 2022.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Lower Bounds on Precedence-Constrained Scheduling for Parallel Processors

We consider two general precedence-constrained scheduling problems that have wide applicability in the areas of parallel processing, high performance compiling, and digital system synthesis. These problems are intractable so it is important to be able to compute tight bounds on their solutions. A tight lower bound on makespan scheduling can be obtained by replacing precedence constraints with r...

متن کامل

An improved genetic algorithm for multidimensional optimization of precedence-constrained production planning and scheduling

Integration of production planning and scheduling is a class of problems commonly found in manufacturing industry. This class of problems associated with precedence constraint has been previously modeled and optimized by the authors, in which, it requires a multidimensional optimization at the same time: what to make, how many to make, where to make and the order to make. It is a combinatorial,...

متن کامل

Scheduling Precedence Constrained Parallel Tasks on Multiprocessors Using the Harmonic System Partitioning Scheme

We present an algorithm for scheduling precedence constrained parallel tasks on multiprocessors with noncontiguous processor allocation. The algorithm is called LLHm (Level-by-level and List scheduling using the Harmonic system partitioning scheme), where m ≥ 1 is a positive integer, which is a parameter for the harmonic system partitioning scheme. Three basic techniques are employed in algorit...

متن کامل

Spill-Free Parallel Scheduling of Precedence Graphs

VLIW scheduling, register allocation This paper concerns the problem of spill-free scheduling of acyclic precedence graphs on a processor with multiple functional units and a limited number of registers. The problem of minimizing the schedule length is well known to be computationally intractable. We present a heuristic for the problem, a general divideand-conquer paradigm that converts any ins...

متن کامل

Multi-Objective Unrelated Parallel Machines Scheduling with Sequence-Dependent Setup Times and Precedence Constraints

This paper presents a novel, multi-objective model of a parallel machines scheduling problem that minimizes the number of tardy jobs and total completion time of all jobs. In this model, machines are considered as unrelated parallel units with different speeds. In addition, there is some precedence, relating the jobs with non-identical due dates and their ready times. Sequence-dependent setup t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IACR transactions on cryptographic hardware and embedded systems

سال: 2023

ISSN: ['2569-2925']

DOI: https://doi.org/10.46586/tches.v2023.i3.246-269